A tabu search approach to optimal structuring element extraction for mst- based shapes description

نویسنده

  • Tianzi Jiang
چکیده

In this paper, we propose a novel method for extracting optimal structure element for MST-based shape description. Speciically, we use tabu search to solve optimal structure element extraction problem for MST-based shape description. In the best of our knowledge, there is very little work on how to explore tabu search in computer vision. Our tabu search (TS) has a number of advantages: (1) TS avoids entrapment in local minima and continues the search to give a near-optimal nal solution ; (2) TS is very general and conceptually much simpler than either SA or GA; (3) TS is very easy to implement and the entire procedure occupies only a few lines of code; (4) TS is a exible framework of a variety of strategies originating from artiicial intelligence and is therefore open to further improvement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A GUIDED TABU SEARCH FOR PROFILE OPTIMIZATION OF FINITE ELEMENT MODELS

In this paper a Guided Tabu Search (GTS) is utilized for optimal nodal ordering of finite element models (FEMs) leading to small profile for the stiffness matrices of the models. The search strategy is accelerated and a graph-theoretical approach is used as guidance. The method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. Comp...

متن کامل

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

متن کامل

3 - D Brain Image Registration Using Optimal Morphological Processing and Iterative Principal Axis Transform

S2 Sn S1 minimum distance minimum distance minimum distance fitness values 3−D positional variations ventricle 3−D shape 3−D structuring elements 3−D MST shape description 3−D MST shape description 3−D MST shape description Figure 1: Block-diagram representation of the 3-D GA optimization procedure. Figure 2: The slices of the optimal 3-D structuring element. able the best discrimination betwee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 71  شماره 

صفحات  -

تاریخ انتشار 1999